Cluster Based Distributed Mutual Exclusion Algorithms for Mobile Networks

نویسنده

  • Kayhan Erciyes
چکیده

We propose an architecture that consists of a ring of clusters for distributed mutual exclusion algorithms in mobile networks. The mobile network is partitioned into a number of clusters periodically using a graph partitioning algorithm called Fixed Centered Partitioning first. Each cluster is represented by a coordinator node on the ring which implements various distributed mutual exclusion algorithms on behalf of any member in the cluster it represents. We show the implementation of Ricart-Agrawala and Token-based algorithms on this architecture. The message complexities for both algorithms are reduced substantially using the proposed architecture . . .

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Software Architecture for Shared Resource Management in Mobile Ad Hoc Networks

We provide the implementation results of the distributed mutual exclusion algorithm based on Ricart-Agrawala algorithm for mobile ad hoc networks (MANETs) using the ns2 simulator described in [2]. The MANET consists of a ring of clusters and it is partitioned into a number of clusters periodically using the MCA [11]. Each cluster is represented by a coordinator. We also show a new algorithm to ...

متن کامل

A Token Based Protocol for Mutual Exclusion in Mobile Ad Hoc Networks

Resource sharing is a major advantage of distributed computing. However, a distributed computing system may have some physical or virtual resource that may be accessible by a single process at a time. The mutual exclusion issue is to ensure that no more than one process at a time is allowed to access some shared resource. The article proposes a token-based mutual exclusion algorithm for the clu...

متن کامل

An Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm

Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...

متن کامل

A Permission-based Clustering Mutual Exclusion Algorithm for Mobile Ad-Hoc Networks

In the last ten years a lot of research has been done on resource allocation in Ad-hoc networks. The Classical approaches of mutual exclusion and its variants need to be modified to suit the dynamic topology, low bandwidth and low processing capabilities of mobile ad-hoc network (MANET).The distributed mutual exclusion in MANETs is comparatively less explored area of research. In this paper, we...

متن کامل

A Distributed Mutual Exclusion Algorithm for Mobile Ad Hoc Networks

We propose a distributed mutual exclusion algorithm for mobile ad hoc networks. This algorithm requires a ring of cluster coordinators as the underlying topology. The topology is built by first providing clusters of mobile nodes in the first step and then forming a backbone consisting of the cluster heads in a ring as the second step. The modified version of the Ricart-Agrawala Algorithm on top...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004